Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties
نویسندگان
چکیده
منابع مشابه
Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
We study a problem in which a set of n jobs has to be batched as well as scheduled for processing on a single machine. A constant machine set-up time is required before the first job of each batch is processed. A schedule specifies the sequence of batches, where each batch comprises a sequence of jobs. The batch delivery time is defined as the completion time of the last job in a batch. The ear...
متن کاملSingle-machine scheduling considering carryover sequence-dependent setup time, and earliness and tardiness penalties of production
Production scheduling is one of the very important problems that industry and production are confronted with it. Production scheduling is often planned in the industrial environments while productivity in production can improve significantly the expansion of simultaneous optimization of the scheduling plan. Production scheduling and production are two areas that have attracted much attention in...
متن کاملMachine scheduling with earliness, tardiness and non-execution penalties
The study of scheduling problems with earliness–tardiness (E/T) penalties is motivated by the just-in-time (JIT) philosophy, which supports the notion that earliness, as well as tardiness, should be discouraged. In this work, we consider several scheduling problems. We begin by generalizing a known polynomial time algorithm that calculates an optimal schedule for a given sequence of tasks, on a...
متن کاملAn Adaptive Genetic Algorithm to the Single Machine Scheduling Problem with Earliness and Tardiness Penalties
This paper deals with the SingleMachine Scheduling Problem with Earliness and Tardiness Penalties, considering distinct due windows and sequence-dependent setup time. Due to its complexity, an adaptive genetic algorithm is proposed for solving it. Many search operators are used to explore the solution space where the choice probability for each operator depends on the success in a previous sear...
متن کاملSingle machine scheduling with controllable processing times to minimize total tardiness and earliness
0360-8352/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.cie.2011.08.019 ⇑ Corresponding author. Tel.: +98 111 2197584; fax E-mail addresses: [email protected] (V. Kay com (I. Mahdavi), [email protected] (G In most deterministic scheduling problems job processing times are considered as invariable and known in advance. Single machine scheduling problem with controllable proces...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2011
ISSN: 0307-904X
DOI: 10.1016/j.apm.2011.01.005